Duality for powerset coalgebras

نویسندگان

چکیده

Let CABA be the category of complete and atomic boolean algebras homomorphisms, let CSL meet-semilattices meet-homomorphisms. We show that forgetful functor from to has a left adjoint. This allows us describe an endofunctor H on such Alg(H) for is dually equivalent Coalg(P) coalgebras powerset P Set. As consequence, we derive Thomason duality Tarski duality, thus paralleling how J\'onsson-Tarski derived Stone duality.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coalgebras, Stone Duality, Modal Logic

A brief outline of the topics of the course could be as follows. Coalgebras generalise transition systems. Modal logics are the natural logics for coalgebras. Stone duality provides the relationship between coalgebras and modal logic. Furthermore, some basic category theory is needed to understand coalgebras as well as Stone duality. So we will need to learn something about modal logic, about S...

متن کامل

Colby]Fuller Duality between Coalgebras

w x In 8 , K. Morita introduced a useful notion of duality between categories of modules, usually called ‘‘Morita duality.’’ He proved that every duality is given by contravariant hom functors defined by a bimodule which is an injective cogenerator for both categories of modules. On the other hand, the equivalences between categories of comodules over a coalgebra w x were characterized by M. Ta...

متن کامل

On descent for coalgebras and type transformations

We find a criterion for a morphism of coalgebras over a Barr-exact category to be effective descent and determine (effective) descent morphisms for coalgebras over toposes in some cases. Also, we study some exactness properties of endofunctors of arbitrary categories in connection with natural transformations between them as well as those of functors that these transformations induce between co...

متن کامل

Abstract Counterexample-Based Refinement for Powerset Domains

Counterexample-based Refinement for Powerset Domains R. Manevich, J. Field , T. A. Henzinger, G. Ramalingam, and M. Sagiv 1 Tel Aviv University, {rumster,msagiv}@tau.ac.il 2 IBM T.J. Watson Research Center, [email protected] 3 EPFL, [email protected] 4 Microsoft Research India, [email protected] Abstract. Counterexample-guided abstraction refinement (CEGAR) is a powerful technique to scale auto...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Logical Methods in Computer Science

سال: 2022

ISSN: ['1860-5974']

DOI: https://doi.org/10.46298/lmcs-18(1:27)2022